Algorithms for computing with nilpotent matrix groups over infinite domains
نویسندگان
چکیده
منابع مشابه
Algorithms for computing with nilpotent matrix groups over infinite domains
We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical nilpotency testing algorithm for matrix groups over an infinite field. We also provide algorithms to answer a number of structural questions for a nilpotent matrix group.The main algorithms h...
متن کاملComputing with Matrix Groups over Infinite Fields
We survey currently available algorithms for computing with matrix groups over infinite domains. We discuss open problems in the area, and avenues for further development.
متن کاملRecognizing finite matrix groups over infinite fields
Article history: Received 12 January 2012 Accepted 10 April 2012 Available online 15 June 2012
متن کاملComputing with matrix groups∗
A group is usually input into a computer by specifying the group either using a presentation or using a generating set of permutations or matrices. Here we will emphasize the latter approach, referring to [Si3, Si4, Ser1] for details of the other situations. Thus, the basic computational setting discussed here is as follows: a group is given, specified as G = 〈X〉 in terms of some generating set...
متن کاملSome Algorithms for Nilpotent Permutation Groups
(Received) Let G, H and E be subgroups of a nite nilpotent permutation group of degree n. We describe the theory and implementation of an algorithm to compute the normalizer N G (H) in time polynomial in n, and we give a modiied algorithm to determine whether H and E are conjugate under G and, if so, to nd a conjugating element of G. Other algorithms produce the intersection G \ H and the centr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2008
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2007.08.001